Performance Evaluation of Visual Path Following Algorithm
نویسندگان
چکیده
منابع مشابه
Experimental Evaluation of an Urban Visual Path following Framework
Robot cars will likely play an important role in the future. In this paper a visual path following framework for urban environments is experimentally evaluated. The framework’s hybrid topological-metric approach for representing the environment provides stable interest points for image-based visual servoing during navigation. The presented experimental results with a robot car show that the fra...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملImplementation and Performance Evaluation of a Multi-Path Incremental Shortest Path Algorithm in Quagga Routing Software
In this paper a multi-path incremental shortest path algorithm has been proposed allowing a quick reconfiguration of a routing table when a network topological change occurs. After evaluating the algorithm complexity, we have implemented it in Quagga, one of the most popular open source routing software. In order to evaluate the algorithm performance, we have realized a test-bed allowing the sh...
متن کاملNeural-swarm visual saliency for path following
This paper extends an existing saliency-based model for path detection and tracking so that the appearance of the path being followed can be learned and used to bias the saliency computation process. The goal is to reduce ambiguities in the presence of strong distractors. In both original and extended path detectors, neural and swarm models are layered in order to attain a hybrid solution. With...
متن کاملPath following algorithm for highly redundant manipulators
8 An algorithm for path planning for highly redundant manipulators is presented in this paper. Assuming an approximated path is given by B-spline curves, path following is defined by requiring manipulator links to remain approximately tangent to these curves. The algorithm decouples manipulator links and establishes each link’s position relative to the curve using a numerical approach. As a res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Institute of Control, Robotics and Systems
سال: 2011
ISSN: 1976-5622
DOI: 10.5302/j.icros.2011.17.9.902